Factoring with n + 2 clean qubits and n − 1 dirty qubits
نویسنده
چکیده
We present reversible classical circuits for performing various arithmetic operations aided by dirty ancillae (i.e. extra qubits in an unknown state that must be restored before the circuit ends). We improve the number of clean qubits needed to factor an n-bit number with Shor’s algorithm [12] from 2n + 2 [15, 8] to n + 2, and the total number of qubits needed from 2n+2 to 2n+ 1, without increasing the asymptotic size or depth of the circuit.
منابع مشابه
Factoring using $2n+2$ qubits with Toffoli based modular multiplication
We describe an implementation of Shor’s quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The circuit depth and the overall gate count are in O(n3) and O(n3 logn), respectively. We thus achieve the same space and time costs as Takahashi et al. [1], while...
متن کاملA fast quantum circuit for addition with few qubits
We show how to construct a fast quantum circuit for computing the sum of two n-bit binary numbers with few qubits. The constructed circuit uses O(n/ logn) ancillary qubits and its depth and size are O(logn) and O(n), respectively. The number of ancillary qubits is asymptotically less than that in Draper et al.’s quantum carry-lookahead adder, and the depth and size are asymptotically the same a...
متن کاملnt - p h / 06 01 09 7 v 1 1 5 Ja n 20 06 Shor ’ s algorithm with fewer ( pure ) qubits
In this note we consider optimised circuits for implementing Shor's quantum factoring algorithm. First I give a circuit for which non of the about 2n qubits need to be initialised (though we still have to make the usual 2n measurements later on). Then I show how the modular additions in the algorithm can be carried out with a superposition of an arithmetic sequence. This makes parallelisation o...
متن کاملPower of Quantum Computation with Few Clean Qubits
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0〉 state, and all the remaining qubits are initially in the totally mixed state. No initializations of qubits are allowed during the computation, nor are intermediate measurements. The main contribution of this paper is to develop unexpectedly strong...
متن کاملFactoring 51 and 85 with 8 qubits
We construct simplified quantum circuits for Shor's order-finding algorithm for composites N given by products of the Fermat primes 3, 5, 17, 257, and 65537. Such composites, including the previously studied case of 15, as well as 51, 85, 771, 1285, 4369, … have the simplifying property that the order of a modulo N for every base a coprime to N is a power of 2, significantly reducing the usual ...
متن کامل